翻訳と辞書 Words near each other ・ non-uniform memory access ・ non-uniform quantising logarithmic compression ・ non-uniform rational b spline ・ non-volatile ・ non-volatile memory ・ non-volatile random access memory ・ non-volatile storage ・ nondeterminism ・ nondeterministic ・ nondeterministic automaton ・ nondeterministic polynomial time ・ nondeterministic turing machine ・ nonintrusive testing ・ nonlinear ・ nonpareil ・ nontrivial ・ noob ・ nor ・ norc compiler ・ norcroft Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク nondeterministic polynomial time ： FOLDOC nondeterministic polynomial time (NP) A set or property of computational {decision problems} solvable by a nondeterministic Turing Machine in a number of steps that is a polynomial function of the size of the input. The word "nondeterministic" suggests a method of generating potential solutions using some form of nondeterminism or "trial and error". This may take exponential time as long as a potential solution can be verified in polynomial time. NP is obviously a superset of P (polynomial time problems solvable by a deterministic Turing Machine in polynomial time) since a deterministic algorithm can be considered as a degenerate form of nondeterministic algorithm. The question then arises: is NP equal to P? I.e. can every problem in NP actually be solved in polynomial time? Everyone's first guess is "no", but no one has managed to prove this; and some very clever people think the answer is "yes". If a problem A is in NP and a polynomial time スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.